Bisimulation Quantified Modal Logics: Decidability
نویسنده
چکیده
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under extension by bisimulation quantifiers.
منابع مشابه
Bisimulation Quantified Logics: Undecidability
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...
متن کاملIdempotent Transductions for Modal Logics
We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quantifiers. These logics are refered to as the idempotent transduction logics and are defined using the programs of propositional dynamic logic including converse and tests. This is a nontrivial extension of the decidability of the pos...
متن کاملThe Freedoms of Guarded Bisimulation
Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi in [1]. Features otherwise known from modal logics are lifted to the richer setting of general relational structures. The leading idea in this generalisation is the relativisation of quantifiers to tuples that are guarded by relational atoms. In a sense that can be...
متن کاملOn First-Order μ-Calculus over Situation Calculus Action Theories
In this paper we study verification of situation calculus action theories against first-order μ-calculus with quantification across situations. Specifically, we consider μLa and μLp, the two variants of μ-calculus introduced in the literature for verification of data-aware processes. The former requires that quantification ranges over objects in the current active domain, while the latter addit...
متن کاملOn PSPACE-decidability in Transitive Modal Logics
In this paper we describe a new method, allowing us to prove PSPACE-decidability for transitive modal logics. We apply it to L1 and L2, modal logics of Minkowski spacetime. We also show how to extend this method to some other transitive logics.
متن کامل